Comparison of Voronoi Based Scattered Data Interpolation Schemes
نویسندگان
چکیده
Voronoi based interpolation employs the concept of natural neighbors to define an interpolating function over discrete data known at scattered sample points. In this work we review the two main concepts for improving interpolation continuity inside the convex hull of the sample domain and compare four natural neighbor interpolants of C and C continuity. We give a visual presentation of all interpolants to provide insight into their overall behavior in addition to a comparison of their analytical and practical properties.
منابع مشابه
Natural Neighbor Interpolation and Order of Continuity
In this paper we give a survey on natural neighbor based interpolation, a class of local scattered data interpolation schemes that define their support on natural neighbors in the Voronoi diagram of the input data sites. We discuss the existing work with respect to common aspects of scattered data interpolation and focus on smoothness of the interpolant.
متن کاملHierarchical Data Representations Based on Planar Voronoi Diagrams
Multiresolution representation of high-dimensional scattered data is a fundamental problem in scientific visualization. This paper introduces a data hierarchy of Voronoi diagrams as a versatile solution. Given an arbitrary set of points in the plane, our goal is the construction of an approximation hierarchy using the Voronoi diagram as the essential building block. We have implemented two Voro...
متن کاملPerformance of the Triangulation-based Methods of Positivity-preserving Scattered Data Interpolation
We present the result and accuracy comparison of generalized positivitypreserving schemes for triangular Bézier patches of 1 C and 2 C scattered data interpolants that have been constructed. We compare three methods of 1 C schemes using cubic triangular Bézier patches and one 2 C scheme using quintic triangular Bézier patches. Our test case consists of four sets of node/test function pairs, wit...
متن کاملAdvances in Digital Image Compression by Adaptive Thinning
This paper proposes a novel concept for digital image compression. The resulting compression scheme relies on adaptive thinning algorithms, which are recent multiresolution methods from scattered data approximation. Adaptive thinning algorithms are recursive point removal schemes, which are combined with piecewise linear interpolation over decremental Delaunay triangulations. This paper shows t...
متن کاملIssues and Implementation of C1 and C2 Natural Neighbor Interpolation
Smooth local coordinates have been proposed by Hiyoshi and Sugihara 2000 to improve the classical Sibson’s and Laplace coordinates. These smooth local coordinates are computed by integrating geometric quantities over weights in the power diagram. In this paper we describe how to efficiently implement the Voronoi based C local coordinates. The globally C interpolant that Hiyoshi and Sugihara pre...
متن کامل